Integer-forcing in multiterminal coding: uplink-downlink duality and source-channel duality

Interference is considered to be a major obstacle to wireless communication. Popular approaches, such as the zero-forcing receiver in MIMO (multiple-input and multiple-output) multiple-access channel (MAC) and zero-forcing (ZF) beamforming in MIMO broadcast channel (BC), eliminate the interference first and decode each codeword separately using a conventional single-user decoder. Recently, a transceiver architecture called integer-forcing (IF) has been proposed in the context of the MIMO Gaussian multiple-access channel to exploit integer-linear combinations of the codewords. Instead of treating other codewords as interference, the integer-forcing approach decodes linear combinations of the codewords from different users and solves for desired codewords. Integer-forcing can closely approach the performance of the optimal joint maximum likelihood decoder. An advanced version called successive integer-forcing can achieve the sum capacity of the MIMO MAC channel. Several extensions of integer-forcing have been developed in various scenarios, such as integer-forcing for the Gaussian MIMO broadcast channel, integer-forcing for Gaussian distributed source coding and integer-forcing interference alignment for the Gaussian interference channel. This dissertation demonstrates duality relationships for integer-forcing among three different channel models. We explore in detail two distinct duality types in this thesis: uplink-downlink duality and source-channel duality. Uplink-downlink duality is established for integer-forcing between the Gaussian MIMO multiple-access channel and its dual Gaussian MIMO broadcast channel. We show that under a total power constraint, integer-forcing can achieve the same sum rate in both cases. We further develop a dirty-paper integer-forcing scheme for the Gaussian MIMO BC and show an uplink-downlink duality with successive integer-forcing for the Gaussian MIMO MAC. The source-channel duality is established for integer-forcing between the Gaussian MIMO multiple-access channel and its dual Gaussian distributed source coding problem. We extend previous results for integer-forcing source coding to allow for successive cancellation. For integer-forcing without successive cancellation in both channel coding and source coding, we show the rates in two scenarios lie within a constant gap of one another. We further show that there exists a successive cancellation scheme such that both integer-forcing channel coding and integer-forcing source coding achieve the same rate tuple

Dose and time response of ruminally infused algae on rumen fermentation characteristics, biohydrogenation and Butyrivibrio group bacteria in goats

Background: Micro-algae could inhibit the complete rumen BH of dietary 18-carbon unsaturated fatty acid (UFAs). This study aimed to examine dose and time responses of algae supplementation on rumen fermentation, biohydrogenation and Butyrivibrio group bacteria in goats. Methods: Six goats were used in a repeated 3 x 3 Latin square design, and offered a fixed diet. Algae were infused through rumen cannule with 0 (Control), 6.1 (L-Alg), or 18.3 g (H-Alg) per day. Rumen contents were sampled on d 0, 3, 7, 14 and 20. Results: H-Alg reduced total volatile fatty acid concentration and acetate molar proportion (P 0.10), while H-Alg reduced the total bacteria abundance (P < 0.05). However, this was induced by a significant difference between control and H-Alg on d 14 (-4.43 %). Afterwards, both treatments did not differ as increased variation in the H-Alg repetitions, with in some cases a return of the bacterial abundance to the basal level (d 0). Conclusions: Changes in rumen fermentation and 18-carbon UFAs metabolism in response to algae were related to the supplementation level, but there was no evidence of shift in ruminal biohydrogenation pathways towards t10-18:1. L-Alg mainly induced a transient effect on rumen biohydrogenation of 18-carbon UFAs, while H-Alg showed an acute inhibition and these effects were not associated with the known hydrogenating bacteria

iPDA: An Integrity-Protecting Private Data Aggregation Scheme for Wireless Sensor Networks

Data aggregation is an efficient mechanism widely used in wireless sensor networks (WSN) to collect statistics about data of interests. However, the shared-medium nature of communication makes the WSNs are vulnerable to eavesdropping and packet tampering/injection by adversaries. Hence, how to protect data privacy and data integrity are two major challenges for data aggregation in wireless sensor networks. In this paper, we present iPDA??????an integrity-protecting private data aggregation scheme. In iPDA, data privacy is achieved through data slicing and assembling technique; and data integrity is achieved through redundancy by constructing disjoint aggregation paths/trees to collect data of interests. In iPDA, the data integrity-protection and data privacy-preservation mechanisms work synergistically. We evaluate the iPDA scheme in terms of the efficacy of privacy preservation, communication overhead, and data aggregation accuracy, comparing with a typical data aggregation scheme--- TAG, where no integrity protection and privacy preservation is provided. Both theoretical analysis and simulation results show that iPDA achieves the design goals while still maintains the efficiency of data aggregation

Location Cheating: A Security Challenge to Location-based Social Network Services

Location-based mobile social network services such as foursquare and Gowalla have grown exponentially over the past several years. These location-based services utilize the geographical position to enrich user experiences in a variety of contexts, including location-based searching and location-based mobile advertising. To attract more users, the location-based mobile social network services provide real-world rewards to the user, when a user checks in at a certain venue or location. This gives incentives for users to cheat on their locations. In this report, we investigate the threat of location cheating attacks, find the root cause of the vulnerability, and outline the possible defending mechanisms. We use foursquare as an example to introduce a novel location cheating attack, which can easily pass the current location verification mechanism (e.g., cheater code of foursquare). We also crawl the foursquare website. By analyzing the crawled data, we show that automated large scale cheating is possible. Through this work, we aim to call attention to location cheating in mobile social network services and provide insights into the defending mechanisms.Comment: 10 pages, 8 figures, accepted by the 31st International Conference on Distributed Computing Systems (ICDCS 2011